all edges造句

• Note that all edges have been petaled with adhesive .
  注意所有边缘都有胶布做瓣。
• The plates were all edged with a rich border of gold
  这些盘子都镶有富丽的金边。
• Gets the dock padding settings for all edges of the
  控件所有边缘的停靠边距设置。
• Gets the dock padding settings for all edges of the control
  获取控件的所有边缘的停靠边距设置。
• Gets or sets the padding width for all edges of a docked control
  获取或设置停靠控件的所有边缘的边距宽度。
• The padding , in pixels , for all edges if the same ; otherwise , - 1
  如果所有边缘的空白相同，则为其空白值（以像素为单位） ；否则为- 1 。
• In every triangle of graph g , either all edges have different weights or all edges have same weights
  在g的每一个三角形中，或者三条边的权相同，或者三条边的权互异
• A control can be docked to one edge of its parent container or can be docked to all edges and fill the parent container
  一个控件可以停靠到其父容器的一个边缘或者可以停靠到所有边缘并充满父容器。
• In order to attain the line edges in images , all edges are thinned by improved sequential thinning algorithm to be one pixel wide at first
  算法从图像中提取直线边缘计算投影不变量，用于对目标建模并跟踪。
• We define the weighted degree of v by the weight of a subgraph h of g is defined by the one with maximum weight among a certain kind of subgraphs is also called heaviest . so a heaviest cycle is a cycle with maximum sum of all edge ' s weights among all cycles of a graph
  顶点v的赋权度定义为图g的子图h的权定义为某类子图中权最大的又叫最重的，所以最重回也就赋权用的所有回中权之和最大的回
• In the forth chapter , we proposes an approach of constructing planar piecewise bezier curve of 3rd 4th and 6th degree with all edges tangent to a given control polygon and the curve segments are joined together with c1 c2 and c3 - continuity . the segmented bezier curves are all shape - preserving to their tangent polygon
  第四章讨论与给定多边形相切的分段三次、四次、六次b zier曲线，所构造的曲线c ~ 1 、 c ~ 2 、 c ~ 3 -连续，并且对切线多边形是保形的。
• In the first chapter , the background and some basic results are introduced . in the second chapter , we study higher order edge connectivity , and obtained ( a ) except for three graphs , all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs , all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs , in particular , necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given
  第二章中，我们研究高阶边连通度，得到了如下结果： ( a )除了三个特殊图外，所有具有有限跃阶的无限循环图都是超边连通的； ( b )除了三种特殊图类外，所有边传递图都是最优- ~ ( 3 )图； ( c )刻划了点传递图的最优- ~ ( 3 )性，特别是给出了cayley图和极小cayley图为最优- ~ ( 3 )图的充分必要条件； ( d )给出了一个图(不一定是对称图)是最优- ~ ( 3 )图的一种充分条件。